\relax 
\citation{Scarf_Karlin58}
\citation{bresina02}
\citation{Scarf_Karlin58}
\citation{reservoir}
\citation{feng04,li05}
\citation{lqgc}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}}
\newlabel{Introduction}{{1}{1}}
\citation{Scarf_Karlin58}
\citation{bitran,wusd10}
\newlabel{eq:trans_inv}{{1}{2}}
\newlabel{eq:transD_inv}{{2}{2}}
\citation{fomdp}
\citation{bahar93add}
\citation{spudd}
\newlabel{rew_inv}{{3}{3}}
\newlabel{eq:vfun_inv}{{4}{3}}
\citation{li05}
\@writefile{toc}{\contentsline {section}{\numberline {2}Discrete and Continuous State-Action MDPs}{4}}
\newlabel{DC-MDP}{{2}{4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Factored Representation}{4}}
\newlabel{sec:dcmdps}{{2.1}{4}}
\citation{boutilier99dt}
\citation{dbn}
\citation{feng04,hao09}
\citation{feng04,li05,hao09}
\newlabel{eq:vfun_def}{{5}{5}}
\citation{bellman}
\newlabel{rew:nonlinear}{{6}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Solution methods}{6}}
\newlabel{sec:soln}{{2.2}{6}}
\newlabel{eq:qfun}{{7}{6}}
\newlabel{eq:vfun}{{8}{6}}
\citation{fomdp}
\citation{fomdp}
\@writefile{toc}{\contentsline {section}{\numberline {3}Symbolic Dynamic Programming}{7}}
\newlabel{SDP}{{3}{7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Case Representation and Operations}{7}}
\newlabel{eq:gen_int}{{9}{9}}
\newlabel{eq:casemax_max}{{10}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Symbolic Dynamic Programming (SDP)}{10}}
\newlabel{alg:vi}{{1}{11}}
\@writefile{loa}{\contentsline {algocf}{\numberline {1}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8\p@ plus2\p@ minus4\p@ \abovedisplayshortskip \z@ plus\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 4.5\p@ plus2\p@ minus\p@ \topsep 9\p@ plus3\p@ minus5\p@ \itemsep 4.5\p@ plus2\p@ minus\p@ {\leftmargin \leftmargini \topsep 4\p@ plus2\p@ minus2\p@ \parsep 2\p@ plus\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip \texttt  {VI}(CSA-MDP, $H$) $\DOTSB \relbar \joinrel \rightarrow $ $(V^h,\pi ^{*,h})$ }}{11}}
\newlabel{alg:regress}{{2}{11}}
\@writefile{loa}{\contentsline {algocf}{\numberline {2}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8\p@ plus2\p@ minus4\p@ \abovedisplayshortskip \z@ plus\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 4.5\p@ plus2\p@ minus\p@ \topsep 9\p@ plus3\p@ minus5\p@ \itemsep 4.5\p@ plus2\p@ minus\p@ {\leftmargin \leftmargini \topsep 4\p@ plus2\p@ minus2\p@ \parsep 2\p@ plus\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip \texttt  {Regress}($V,a,\mathaccentV {vec}17E{y}$) $\DOTSB \relbar \joinrel \rightarrow $ $Q$ }}{11}}
\newlabel{eq:one_int}{{11}{12}}
\newlabel{eq:cond_sub}{{12}{12}}
\newlabel{alg:contMax}{{3}{14}}
\@writefile{loa}{\contentsline {algocf}{\numberline {3}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8\p@ plus2\p@ minus4\p@ \abovedisplayshortskip \z@ plus\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 4.5\p@ plus2\p@ minus\p@ \topsep 9\p@ plus3\p@ minus5\p@ \itemsep 4.5\p@ plus2\p@ minus\p@ {\leftmargin \leftmargini \topsep 4\p@ plus2\p@ minus2\p@ \parsep 2\p@ plus\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip \texttt  {Continuous Maximization}($y$, $f(\mathaccentV {vec}17E{b},\mathaccentV {vec}17E{x},y)$) $\DOTSB \relbar \joinrel \rightarrow (max_{y}f(\mathaccentV {vec}17E{b},\mathaccentV {vec}17E{x},y)$ }}{14}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Extended Algebric Decision Diagrams (XADDs)}{14}}
\newlabel{XADD}{{4}{14}}
\citation{bout96}
\citation{bahar93add}
\citation{spuddip}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Formal Definition and Operations}{15}}
\citation{bryant}
\citation{cox}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.1.1}Unary XADD Operations}{19}}
\citation{penberthy94}
\newlabel{fig:reorder}{{4}{20}}
\@writefile{loa}{\contentsline {algocf}{\numberline {4}{\ignorespaces {\sc  Reorder}(F) }}{20}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.1.2}Binary XADD Operations}{20}}
\newlabel{algReduceXADD}{{5}{21}}
\@writefile{loa}{\contentsline {algocf}{\numberline {5}{\ignorespaces {\sc  ReduceXADD}(F) }}{21}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}XADD Algorithms}{21}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.1}Reduce Algorithm for XADDs}{21}}
\newlabel{algGetNode}{{6}{22}}
\@writefile{loa}{\contentsline {algocf}{\numberline {6}{\ignorespaces {\sc  GetNode}($\delimiter "426830A \mathit  {var}, F_h, F_l \delimiter "526930B $) }}{22}}
\newlabel{algChooseVarBranch}{{7}{22}}
\@writefile{loa}{\contentsline {algocf}{\numberline {7}{\ignorespaces {\sc  ChooseVarBranch}($F_1,F_2$) }}{22}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.2}Apply Algorithm for binary operations of XADDs}{22}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Input case and result for the method \emph  {ComputeResult} for binary operations $\oplus $, $\ominus $ and $\otimes $ for XADDs.}}{23}}
\newlabel{tab:ComputeResultXADD}{{1}{23}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.3}Continuous Maximization Algorithm for XADDs}{23}}
\newlabel{algApply}{{8}{24}}
\@writefile{loa}{\contentsline {algocf}{\numberline {8}{\ignorespaces {\sc  Apply}($F_1,F_2,\mathit  {op}$) }}{24}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8\p@ plus2\p@ minus4\p@ \abovedisplayshortskip \z@ plus\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 4.5\p@ plus2\p@ minus\p@ \topsep 9\p@ plus3\p@ minus5\p@ \itemsep 4.5\p@ plus2\p@ minus\p@ {\leftmargin \leftmargini \topsep 4\p@ plus2\p@ minus2\p@ \parsep 2\p@ plus\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip Representing one step of Continuous Maximization algorithm using XADDs. The upper and lower bounds of action $a$ and the root is represented by XADDs and substituted inside the leaf node. The maximum of the upper and lower bound is then represented. The final result takes the maximum of this and the root considering the constraints and independent decisions and also linearizing the decision nodes.}}{25}}
\newlabel{fig:xadd_max}{{1}{25}}
\newlabel{algLinearize}{{9}{25}}
\@writefile{loa}{\contentsline {algocf}{\numberline {9}{\ignorespaces {\sc  ReduceLinearize}(F) }}{25}}
